全文获取类型
收费全文 | 112881篇 |
免费 | 6690篇 |
国内免费 | 5445篇 |
专业分类
化学 | 50419篇 |
晶体学 | 1181篇 |
力学 | 8635篇 |
综合类 | 380篇 |
数学 | 36448篇 |
物理学 | 27953篇 |
出版年
2023年 | 676篇 |
2022年 | 714篇 |
2021年 | 1060篇 |
2020年 | 1485篇 |
2019年 | 1409篇 |
2018年 | 11368篇 |
2017年 | 11118篇 |
2016年 | 7746篇 |
2015年 | 2604篇 |
2014年 | 2464篇 |
2013年 | 3125篇 |
2012年 | 6965篇 |
2011年 | 13703篇 |
2010年 | 8012篇 |
2009年 | 8227篇 |
2008年 | 9107篇 |
2007年 | 10870篇 |
2006年 | 2250篇 |
2005年 | 3020篇 |
2004年 | 3007篇 |
2003年 | 3229篇 |
2002年 | 2470篇 |
2001年 | 1395篇 |
2000年 | 1166篇 |
1999年 | 944篇 |
1998年 | 777篇 |
1997年 | 637篇 |
1996年 | 734篇 |
1995年 | 589篇 |
1994年 | 477篇 |
1993年 | 425篇 |
1992年 | 337篇 |
1991年 | 335篇 |
1990年 | 236篇 |
1989年 | 223篇 |
1988年 | 164篇 |
1987年 | 159篇 |
1986年 | 172篇 |
1985年 | 134篇 |
1984年 | 92篇 |
1983年 | 78篇 |
1982年 | 66篇 |
1981年 | 65篇 |
1980年 | 60篇 |
1979年 | 59篇 |
1978年 | 45篇 |
1914年 | 45篇 |
1912年 | 40篇 |
1909年 | 41篇 |
1908年 | 40篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
991.
Wei Gao Muhammad Imran Abdul Qudair Baig Haidar Ali Mohammad Reza Farahani 《Journal of Applied Mathematics and Computing》2017,55(1-2):99-117
In QSAR/QSPR study, physico-chemical properties and topological indices such as Randi?, atom-bond connectivity (ABC) and geometric-arithmetic (GA) index are used to predict the bioactivity of chemical compounds. A topological index is actually designed by transforming a chemical structure into a numeric number. These topological indices correlate certain physico-chemical properties like boiling point, stability, strain energy etc. of chemical compounds. Graph theory has found a considerable use in this area of research. The topological indices of certain interconnection networks were studied recently by Imran et al. (Appl Math Comput 244:936–951, 2014). In this paper, we extend this study to \(n\times n\) Sudoku graphs and derive analytical closed results of general Randi? index \(R_{\alpha }(G)\) for different values of “\(\alpha \)” for Sudoku (SK). We also compute the general Randi?, first Zagreb, ABC, GA, \(ABC_{4}\) and \(GA_{5}\) indices and give closed formulae of these indices for Sudoku graphs. 相似文献
992.
Ping Li Xuemei Guo Shixin Zhu Xiaoshan Kai 《Journal of Applied Mathematics and Computing》2017,54(1-2):307-324
In this paper, we mainly study the theory of linear codes over the ring \(R =\mathbb {Z}_4+u\mathbb {Z}_4+v\mathbb {Z}_4+uv\mathbb {Z}_4\). By using the Chinese Remainder Theorem, we prove that R is isomorphic to a direct sum of four rings. We define a Gray map \(\Phi \) from \(R^{n}\) to \(\mathbb {Z}_4^{4n}\), which is a distance preserving map. The Gray image of a cyclic code over R is a linear code over \(\mathbb {Z}_4\). We also discuss some properties of MDS codes over R. Furthermore, we study the MacWilliams identities of linear codes over R and give the generator polynomials of cyclic codes over R. 相似文献
993.
Generalized constant ratio surfaces are defined by the property that the tangential component of the position vector is a principal direction on the surfaces. In this work, we study these class of surfaces in the 3-dimensional Minkowski space L3. We achieve a complete classification of spacelike generalized constant ratio surfaces in L3. 相似文献
994.
We give a further study on B-tensors and introduce doubly B-tensors that contain B-tensors. We show that they have similar properties, including their decompositions and strong relationship with strictly (doubly) diagonally dominated tensors. As an application, the properties of B-tensors are used to localize real eigenvalues of some tensors, which would be very useful in verifying the positive semi-definiteness of a tensor. 相似文献
995.
Let A and B be algebras, and let T be the dual extension algebra of A and B. We provide a different method to prove that T is Koszul if and only if both A and B are Koszul. Furthermore, we prove that an algebra is Koszul if and only if one of its iterated dual extension algebras is Koszul, if and only if all its iterated dual extension algebras are Koszul. Finally, we give a necessary and sufficient condition for a dual extension algebra to have the property that all linearly presented modules are Koszul modules, which provides an effective way to construct algebras with such a property. 相似文献
996.
Let G = (V,A) be a digraph and k ≥ 1 an integer. For u, v ∈ V, we say that the vertex u distance k-dominate v if the distance from u to v at most k. A set D of vertices in G is a distance k-dominating set if each vertex of V D is distance k-dominated by some vertex of D. The distance k-domination number of G, denoted by γ k (G), is the minimum cardinality of a distance k-dominating set of G. Generalized de Bruijn digraphs G B (n, d) and generalized Kautz digraphs G K (n, d) are good candidates for interconnection networks. Denote Δ k := (∑ j=0 k d j )?1. F. Tian and J. Xu showed that ?nΔ k ? γ k (G B (n, d)) ≤?n/d k? and ?nΔ k ? ≤ γ k (G K (n, d)) ≤ ?n/d k ?. In this paper, we prove that every generalized de Bruijn digraph G B (n, d) has the distance k-domination number ?nΔ k ? or ?nΔ k ?+1, and the distance k-domination number of every generalized Kautz digraph G K (n, d) bounded above by ?n/(d k?1+d k )?. Additionally, we present various sufficient conditions for γ k (G B (n, d)) = ?nΔ k ? and γ k (G K (n, d)) = ?nΔ k ?. 相似文献
997.
Key distribution patterns (KDPs) are finite incidence structures satisfying a certain property which makes them widely used in minimizing the key storage and ensuring the security of communication between users in a large network. We construct a new KDP using t-design and combine two ω-KDPs to give new (ω-1)-KDPs, which provide secure communication in a large network and minimize the amount of key storage. 相似文献
998.
H is called an ? p -embedded subgroup of G, if there exists a p-nilpotent subgroup B of G such that H p ∈ Syl p (B) and B is ? p -supplemented in G. In this paper, by considering prime divisor 3, 5, or 7, we use ? p -embedded property of primary subgroups to investigate the solvability of finite groups. The main result is follows. Let E be a normal subgroup of G, and let P be a Sylow 5-subgroup of E. Suppose that 1 < d ? |P| and d divides |P|. If every subgroup H of P with |H| = d is ?5-embedded in G, then every composition factor of E satisfies one of the following conditions: (1) I/C is cyclic of order 5, (2) I/C is 5′-group, (3) I/C ? A5. 相似文献
999.
A k-total coloring of a graph G is a mapping ?: V (G) ? E(G) → {1; 2,..., k} such that no two adjacent or incident elements in V (G) ? E(G) receive the same color. Let f(v) denote the sum of the color on the vertex v and the colors on all edges incident with v: We say that ? is a k-neighbor sum distinguishing total coloring of G if f(u) 6 ≠ f(v) for each edge uv ∈ E(G): Denote χ Σ ″ (G) the smallest value k in such a coloring of G: Pil?niak and Wo?niak conjectured that for any simple graph with maximum degree Δ(G), χ Σ ″ ≤ Δ(G)+3. In this paper, by using the famous Combinatorial Nullstellensatz, we prove that for K 4-minor free graph G with Δ(G) > 5; χ Σ ″ = Δ(G) + 1 if G contains no two adjacent Δ-vertices, otherwise, χ Σ ″ (G) = Δ(G) + 2. 相似文献
1000.
Quanwu Mu 《Frontiers of Mathematics in China》2017,12(6):1457-1468
Let d ? 3 be an integer, and set r = 2d?1 + 1 for 3 ? d ? 4, \(\tfrac{{17}}{{32}} \cdot 2^d + 1\) for 5 ? d ? 6, r = d2+d+1 for 7 ? d ? 8, and r = d2+d+2 for d ? 9, respectively. Suppose that Φ i (x, y) ∈ ?[x, y] (1 ? i ? r) are homogeneous and nondegenerate binary forms of degree d. Suppose further that λ1, λ2,..., λ r are nonzero real numbers with λ1/λ2 irrational, and λ1Φ1(x1, y1) + λ2Φ2(x2, y2) + · · · + λ r Φ r (x r , y r ) is indefinite. Then for any given real η and σ with 0 < σ < 22?d, it is proved that the inequality has infinitely many solutions in integers x1, x2,..., x r , y1, y2,..., y r . This result constitutes an improvement upon that of B. Q. Xue.
相似文献
$$\left| {\sum\limits_{i = 1}^r {{\lambda _i}\Phi {}_i\left( {{x_i},{y_i}} \right) + \eta } } \right| < {\left( {\mathop {\max \left\{ {\left| {{x_i}} \right|,\left| {{y_i}} \right|} \right\}}\limits_{1 \leqslant i \leqslant r} } \right)^{ - \sigma }}$$